TSTP Solution File: SEV445^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV445^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:43:13 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 12 unt; 5 typ; 0 def)
% Number of atoms : 58 ( 16 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 71 ( 11 ~; 0 |; 0 &; 59 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 35 ( 5 ^ 23 !; 4 ?; 35 :)
% ( 3 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/UNIV':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_6,type,
sK1: sK0 ).
thf(func_def_9,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f24,plain,
$false,
inference(trivial_inequality_removal,[],[f23]) ).
thf(f23,plain,
$true != $true,
inference(beta_eta_normalization,[],[f22]) ).
thf(f22,plain,
( $true
!= ( ^ [Y0: sK0] : $true
@ sK1 ) ),
inference(superposition,[],[f17,f14]) ).
thf(f14,plain,
! [X0: $tType,X2: X0,X1: X0 > $o] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: $tType,X1: X0 > $o,X2: X0] :
( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
= ( X1 @ X2 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X2: X0 > $o,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ X2 )
= ( X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.REH8yw4moT/Vampire---4.8_13148','thm/sets/IN_') ).
thf(f17,plain,
( $true
!= ( 'const/sets/IN' @ sK0 @ sK1
@ ^ [Y0: sK0] : $true ) ),
inference(definition_unfolding,[],[f16,f15]) ).
thf(f15,plain,
! [X0: $tType] :
( 'const/sets/UNIV'
@ ( X0
= ( ^ [Y0: X0] : $true ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
! [X0: $tType] :
( 'const/sets/UNIV'
@ ( X0
= ( ^ [Y0: X0] : $true ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType] :
( 'const/sets/UNIV'
@ ( X0
= ( ^ [X1: X0] : $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.REH8yw4moT/Vampire---4.8_13148','thm/sets/UNIV_') ).
thf(f16,plain,
( $true
!= ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( $true
!= ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f12]) ).
thf(f12,plain,
( ? [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
!= $true )
=> ( $true
!= ( 'const/sets/IN' @ sK0 @ sK1 @ 'const/sets/UNIV' @ sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
? [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
!= $true ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
~ ! [X0: $tType,X1: X0] :
( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 )
= $true ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
~ ! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: $tType,X1: X0] : ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/UNIV' @ X0 ),
file('/export/starexec/sandbox/tmp/tmp.REH8yw4moT/Vampire---4.8_13148','thm/sets/IN_UNIV_') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV445^1 : TPTP v8.1.2. Released v7.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 12:33:32 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH1_THM_EQU_NAR problem
% 0.14/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.REH8yw4moT/Vampire---4.8_13148
% 0.14/0.37 % (13263)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.14/0.37 % (13262)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.14/0.37 % (13257)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.14/0.37 % (13258)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.14/0.37 % (13260)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38 % (13259)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.14/0.38 % (13263)First to succeed.
% 0.14/0.38 % Exception at run slice level
% 0.14/0.38 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.14/0.38 % (13261)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.14/0.38 % (13258)Also succeeded, but the first one will report.
% 0.14/0.38 % (13259)Instruction limit reached!
% 0.14/0.38 % (13259)------------------------------
% 0.14/0.38 % (13259)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (13259)Termination reason: Unknown
% 0.14/0.38 % (13259)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (13263)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for Vampire---4
% 0.14/0.38 % SZS output start Proof for Vampire---4
% See solution above
% 0.14/0.38 % (13263)------------------------------
% 0.14/0.38 % (13263)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (13263)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (13263)Memory used [KB]: 5500
% 0.14/0.38 % (13263)Time elapsed: 0.004 s
% 0.14/0.38 % (13263)Instructions burned: 2 (million)
% 0.14/0.38 % (13263)------------------------------
% 0.14/0.38 % (13263)------------------------------
% 0.14/0.38 % (13255)Success in time 0.004 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------